Generalized de Bruijn digraphs and the distribution of patterns in ?-expansions

نویسنده

  • Wolfgang Steiner
چکیده

A generalization of de Bruijn digraphs is defined for Parry’s α-expansions and it is shown that the characteristic polynomial of these graphs is in principle that of α. With the help of this result we prove that certain functionals of α-expansions, e.g. the number of specific digital patterns, satisfy a central limit theorem, which is an extension of a result due to Drmota [3].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs

This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating sets for undirected graphs. Whereas dominating sets for digraphs have more applications than those for undirected graphs. We construct dominating sets of generalized de Bruijn digraphs where obtained dominating sets ...

متن کامل

Rainbow Domination in Generalized de Bruijn Digraphs

In this paper, we are concerned with the krainbow domination problem on generalized de Bruijn digraphs. We give an upper bound and a lower bound for the k-rainbow domination number in generalized de Bruijn digraphs GB(n, d). We also show that γrk(GB(n, d)) = k if and only if α 6 1, where n = d+α and γrk(GB(n, d)) is the k-rainbow domination number of GB(n, d).

متن کامل

Solution to Some Open Problems on Absorbant of Generalized de Bruijn Digraphs

The generalized de Bruijn digraph GB(n,d) has good properties as an interconnection network topology. The resource location problem in an interconnection network is one of the facility location problems. Finding absorbants of a digraph corresponds to solving a kind of resource location problem. In this paper, we solve some open problems given in the article ”Erfang Shan, T.C.E.Cheng, Liying Kan...

متن کامل

Hamiltonicity of large generalized de Bruijn cycles

In this article, we determine when the large generalized de Bruijn cycles BGC(p, d, n) are Hamiltonian. These digraphs have been introduced by Gómez, Padró and Pérennes as large interconnection networks with small diameter and they are a family of generalized p-cycles. They are the Kronecker product of the generalized de Bruijn digraph GB(d, n) and the dicycle of length p, where GB(d, n) is the...

متن کامل

Isomorphic factorization, the Kronecker product and the line digraph

In this paper, we investigate isomorphic factorizations of the Kronecker product graphs. Using these relations, it is shown that (1) the Kronecker product of the d-out-regular digraph and the complete symmetric digraph is factorized into the line digraph, (2) the Kronecker product of the Kautz digraph and the de Bruijn digraph is factorized into the Kautz digraph, (3) the Kronecker product of b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 263  شماره 

صفحات  -

تاریخ انتشار 2003